Empirical Comparison of Filtering Techniques for On-the-fly Data Race Detection in OpenMP Programs

It is a well-known that data races in implicit threading applications, such as OpenMP programs, are the most notorious class of concurrency bugs, because they may lead to unpredictable results of the program. The main drawback of on-the-fly data race detection techniques is the heavy additional overheads for analyzing every memory operations and thread operations, such as load, store, fork, and join. It is important to reduce the additional overheads for debugging the concurrency bug. This paper presents an empirical comparison of two filtering techniques which are applied to parallel programs with OpenMP directives for dynamic data race detection.